Link Reversal Routing with Binary Link Labels: Work Complexity
نویسندگان
چکیده
منابع مشابه
Link Reversal Routing with Binary Link Labels: Work Complexity
Full Reversal and Partial Reversal are two well-known routing algorithms that were introduced by Gafni and Bertsekas [IEEE Trans. Commun., 29 (1981), pp. 11–18]. By reversing the directions of some links of the graph, these algorithms transform a connected input DAG (directed acyclic graph) into an output DAG in which each node has at least one path to a distinguished destination node. We prese...
متن کاملAnalysis of Link Reversal Routing Algorithms
Link reversal algorithms provide a simple mechanism for routing in communication networks whose topology is frequently changing, such as in mobile ad hoc networks. A link reversal algorithm routes by imposing a direction on each network link such that the resulting graph is a destination oriented DAG. Whenever a node loses routes to the destination, it reacts by reversing some (or all) of its i...
متن کاملLoop-Free Backpressure Routing Using Link-Reversal Algorithms
The backpressure routing policy is known to be a throughput optimal policy that supports any feasible traffic demand in data networks, but may have poor delay performance when packets traverse loops in the network. In this paper, we study loop-free backpressure routing policies that forward packets along directed acyclic graphs (DAGs) to avoid the looping problem. These policies use link revers...
متن کاملProperties of Link Reversal Algorithms for Routing and Leader
We present two link-reversal algorithms and some interesting properties that they satisfy. First, we describe the Partial Reversal (PR) algorithm [13], which ensures that the underlying graph structure is destination-oriented and acyclic. These properties of PR make it useful in routing protocols and algorithms for solving leader election and mutual exclusion. While proofs exist to establish th...
متن کاملLoad Balanced Link Reversal Routing in Wireless Ad Hoc Networks
The link reversal routing (LRR) algorithm maintains loop free routes in mobile ad hoc wireless networks while incurring low overhead. In this paper we explore the problem of balancing the load of forwarding traffic in LRR algorithm. We make some important observations regarding the situations that lead to load unbalance in the LRR algorithm and formally define the load balancing problem. Based ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2013
ISSN: 0097-5397,1095-7111
DOI: 10.1137/110843095